Social patterns restrict evolving grammars ( stageverslag )

نویسندگان

  • Paulien Hogeweg
  • Michael Moortgat
چکیده

This paper reports on an internship at the department of theoretical biology at Utrecht University between October 1998 and February 1999. Aim of the project was to implement and study the computational model of language evolution reported by Hashimoto & Ikegami (1996) and to reproduce their results. The project was undertaken as a preparation for more original research for amaster’s thesis, and among other things to improve programming skills and to get more familiar with language evolution and modeling methodology. This report consists of six sections, discussing the origin of language debate, the Hashimoto Ikegami model, the developed implementation, the main results with some hints on subsequent work, conclusions and a short self-evaluation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Social patterns guide evolving grammars

We study the evolution of syntax in a simple multi-agent model. The fitness of agents in the model is not a fixed function of the individual languages, but depends on their communicative success in the group and thus on the composition of the population. This fact significantly alters the evolutionary dynamics, and can both facilitate and hinder the development of syntactic language. The result...

متن کامل

A Polynomial Time Algorithm for Inferring Grammars for Mildly Context Sensitive Languages

Natural languages are largely context-sensitive, yet context-sensitive grammars cannot be identified in the limit from positive examples [Gold, 1967]. Mildly context-sensitive languages are able to express the most common context-sensitive structures found in natural language. We restrict our view to a class of mildly context-sensitive languages which can be described by simple external context...

متن کامل

Subregularly Tree Controlled Grammars and Languages

Tree controlled grammars are context-free grammars where the associated language only contains those terminal words which have a derivation where the word of any level of the corresponding derivation tree belongs to a given regular language. We present some results on the power of such grammars where we restrict the regular languages to some known subclasses of the family of regular languages.

متن کامل

Abstract Interpretation of Graph Grammars

Interpretation of Graph Grammars ? Jörg Bauer and Reinhard Wilhelm Informatik; Univ. des Saarlandes; Saarbrücken, Germany. {joba,wilhelm}@cs.uni-sb.de Abstract. Many communication systems, distributed algorithms, or heap manipulating programs are hard to verify due to their inherent unboundedness. Their semantics can be described by evolving graphs. Graph grammars are a natural, intuitive, and ...

متن کامل

Empirical Risk Minimization with Approximations of Probabilistic Grammars

When approximating a family of probabilistic grammars, it is convenient to assume the degree of the grammar is limited. We limit the degree of the grammar by making the assumption that Nk ≤ 2. This assumption may seem, at first glance, somewhat restrictive, but we show next that for probabilistic context-free grammars (and as a consequence, other formalisms), this assumption does not restrict g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999